منابع مشابه
Global convergence of a modified spectral FR conjugate gradient method
A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergenc...
متن کاملGlobal Convergence of a Modified Liu-storey Conjugate Gradient Method
In this paper, we make a modification to the LS conjugate gradient method and propose a descent LS method. The method can generates sufficient descent direction for the objective function. We prove that the method is globally convergent with an Armijo-type line search. Moreover, under mild conditions, we show that the method is globally convergent if the Armijo line search or the Wolfe line sea...
متن کاملGlobal Convergence of a Modified Sqp Method for Mathematical Programs with Inequalities and Equalities Constraints
When we solve an ordinary nonlinear programming problem by the most and popular sequential quadratic programming (SQP) method, one of the difficulties that we must overcome is to ensure the consistence of its QP subproblems. In this paper, we develop a new SQP method which can assure that the QP subproblem at every iteration is consistent. One of the main techniques used in our method involves ...
متن کاملGlobal Convergence of a Sticky Particle Method for the Modified Camassa-Holm Equation
In this paper, we prove convergence of a sticky particle method for the modified Camassa–Holm equation (mCH) with cubic nonlinearity in one dimension. As a byproduct, we prove global existence of weak solutions u with regularity: u and ux are space-time BV functions. The total variation of m(·, t) = u(·, t)− uxx(·, t) is bounded by the total variation of the initial data m0. We also obtain W 1,...
متن کاملA Stabilized Sqp Method: Global Convergence
Stabilized sequential quadratic programming (SQP) methods for nonlinear optimization are designed to provide a sequence of iterates with fast local convergence regardless of whether or not the active-constraint gradients are linearly dependent. This paper concerns the global convergence properties of a stabilized SQP method with a primal-dual augmented Lagrangian merit function. The proposed me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/910303